Experimental Study on Speed-Up Techniques for Timetable Information Systems
نویسندگان
چکیده
During the last years, impressive speed-up techniques for DIJKSTRA’s algorithm have been developed. Unfortunately, recent research mainly focused on road networks. However, fast algorithms are also needed for other applications like timetable information systems. Even worse, the adaption of recently developed techniques to timetable information is more complicated than expected. In this work, we check whether results from road networks are transferable to timetable information. To this end, we present an extensive experimental study of the most prominent speed-up techniques on different types of inputs. It turns out that recently developed techniques are much slower on graphs derived from timetable information than on road networks. In addition, we gain amazing insights into the behavior of speed-up techniques in general.
منابع مشابه
Experimental study of speed up techniques for timetable information systems
In recent years, many speed-up techniques for DIJKSTRA’s algorithm have been developed. Unfortunately, research mainly focused on road networks although fast algorithms are also needed for other applications like timetable information systems. Even worse, the adaption of recently developed techniques to graphs deriving from timetable information problems is often more complicated than expected....
متن کاملContracting Timetable Information Networks
During the last years, impressive progress has been achieved in the field of speed-up techniques for DIJKSTRA’s algorithm. Due to the availability of road networks, most speed-up techniques were developed for such networks. The fastest known techniques use contraction, a procedure that reduces the graph size, in order to gain their impressive speed-ups. However, in a recent work it was observed...
متن کاملUsing Multi-level Graphs for Timetable Information in Railway Systems
In many fields of application, shortest path finding problems in very large graphs arise. Scenarios where large numbers of on-line queries for shortest paths have to be processed in real-time appear for example in traffic information systems. In such systems, the techniques considered to speed up the shortest path computation are usually based on precomputed information. One approach proposed o...
متن کاملMaintenance of Multi-level Overlay Graphs for Timetable Queries
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s algorithm. Due to the continuously growing size of real-world graphs, there is a constant need for faster algorithms and many techniques have been devised to heuristically speed up Dijkstra’s algorithm. One of these tech...
متن کاملEngineering Graph-Based Models for Dynamic Timetable Information Systems
Many efforts have been done in the last years to model public transport timetables in order to find optimal routes. The proposed models can be classified into two types: those representing the timetable as an array, and those representing it as a graph. The array-based models have been shown to be very effective in terms of query time, while the graph-based models usually answer queries by comp...
متن کامل